Nuprl Lemma : cons_sublist_cons 11,40

T:Type, x1,x2:TL1,L2:(T List).
sublist(T; cons(x1L1); cons(x2L2))
 (((x1 = x2 sublist(TL1L2))  sublist(T; cons(x1L1); L2)) 
latex


Definitionsprop{i:l}, t  T, Y, ||as||, P  Q, P  Q, P  Q, P  Q, sublist(TL1L2), P  Q, x:AB(x), suptype(ST), subtype(ST), x:AB(x), guard(T), sq_type(T), False, A, A  B, increasing(fk), lelt(ijk), int_seg(ij), True, T, , ff, tt, if b then t else f fi , decidable(P), nequal(Tab), Unit, ,
Lemmassublist wf, non neg length, neg assert of eq int, assert of eq int, length wf1, int seg wf, eq int wf, decidable assert, length cons, select wf, increasing wf, select cons hd, increasing lower bound, le wf, select cons tl, squash wf, not functionality wrt iff, assert of bnot, eqff to assert, eqtt to assert, iff transitivity, not wf, bnot wf, assert wf, bool wf, true wf

origin